A Unified Approach to Concurrency Control and Transaction Recovery (Extended Abstract)

نویسندگان

  • Gustavo Alonso
  • Radek Vingralek
  • Divyakant Agrawal
  • Yuri Breitbart
  • Amr El Abbadi
  • Hans-Jörg Schek
  • Gerhard Weikum
چکیده

Conventional transaction management in shared databases is traditionally viewed as a combination of two orthogonal problems. One is to guarantee correctness when several transactions are executed concurrently. This is ensured by the concurrency control component of a transaction processing system. The other is to ensure the correctness of the database in spite of transaction aborts and system failures. This is ensured by the recovery mcchanism. In both cases there are several criteria that impose increasing restrictions on executions, resulting in a hierarchy in which only the most restrictive criteria are chosen for implementing concurrency control and recovery mechanisms. The result is that the different criteria are incomparable except for the most restrictive criterion in each component. For instance, strict two phase locking and log based recovery with before images has become the de facto standard (i.e. rigorous schedules [BGRS91], once considered as a possible candidate for a unified treatment of concurrency control and transaction recovery). Recently, Schek, Weikum and Ye [SWY93] have developed a unified theory for concurrency control and recovery. In this theory, the traditional concurrency control theory is expanded to include the actions of aborted transactions. As a result, the extended theory can be used to determine whether a given execution is correct both from a concurrency control as well as recovery points of view. A hierarchy of correctness classes is defined and the authors introduce a particular class, called prefix-reducibility (PRED). PRED is argued to be the most

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unifying Concurrency Control and Recovery of Transactions with Semantically Rich Operations

The classical theory of transaction management contains two different aspects, namely concurrency control and recovery, which ensure serializability and atomicity of transaction executions, respectively. Although concurrency control and recovery are not independent of each other, the criteria for these two aspects were developed orthogonally and as a result, in most cases these criteria are inc...

متن کامل

Concurrency Control and Object-Oriented Databases

2 Transaction Approach 47 2.1 A Design Task Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 2.2 Compatibility Set Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 2.3 Constraint-Based Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 2.3.1 Intuitive Model of CAD Transaction . . . . . . . . . . . . . . . . . . . ...

متن کامل

Dictatorial Transaction Processing : Atomic Commitment without Veto Right 1

The current standard in governing distributed transaction termination is the so-called Two-Phase Commit protocol (2PC). The first phase of 2PC is a voting phase, where the participants in the transaction are given an ultimate right to abort that transaction. Giving up that veto right from all participants reduces the overhead of the atomic commitment protocol but also imposes some restrictions ...

متن کامل

Unifying Memory and Database Transactions

Software Transactional Memory is a concurrency control technique gaining increasing popularity, as it provides high-level concurrency control constructs and eases the development of highly multi-threaded applications. But this easiness comes at the expense of restricting the operations that can be executed within a memory transaction, and operations such as terminal and file I/O are either not ...

متن کامل

An open and safe nested transaction model: concurrency and recovery

In this paper, we present an open and safe nested transaction model. We discuss the concurrency control and recovery algorithms for our model. Our nested transaction model uses the notion of a recovery point subtransaction in the nested transaction tree. It incorporates a prewrite operation before each write operation to increase the potential concurrency. Our transaction model is termed ``open...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994